EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS
نویسندگان
چکیده
منابع مشابه
Efficient algorithms for the basis of finite Abelian groups
Let G be a finite abelian group G with N elements. In this paper we give a O(N) time algorithm for computing a basis of G. Furthermore, we obtain an algorithm for computing a basis from a generating system of G with M elements having time complexity O(M ∑ p|N e(p)⌈p 1/2⌉μ(p)), where p runs over all the prime divisors of N , and pe(p), μ(p) are the exponent and the number of cyclic groups which ...
متن کاملLinear Time Algorithms for the Basis of Abelian Groups
It is well known that every finite Abelian group G can be represented as a product of cyclic groups: G = G1×G2×· · ·Gt, where each Gi is a cyclic group of size p j for some prime p and integer j ≥ 1. If ai is the generator of the cyclic group of Gi, i = 1, 2, · · · , t, then the elements a1, a2, · · · , at are the basis of G. In this paper, we first obtain an O(n)-time deterministic algorithm f...
متن کاملLinear and Sublinear Time Algorithms for Basis of Abelian Groups
It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G ∼= G1 × G2 × · · · × Gt, where each Gi is a cyclic group of order p j for some prime p and integer j ≥ 1. If ai generates the cyclic group of Gi, i = 1, 2, · · · , t, then the elements a1, a2, · · · , at are called a basis of G. We show an algorithm such that given a set of generators M...
متن کاملEfficient multiplication algorithms for finite polycyclic groups
Let G be a finite soluble group given by a reduced confluent polycyclic presentation. Represent group elements by reduced words. Then there exists an algorithm for multiplying two group elements which has subexponential running time and requires polynomial space. Moreover, given the prime factorisation of the group order, the problem of multiplying two group elements is probabilistically polyno...
متن کاملOn non-normal non-abelian subgroups of finite groups
In this paper we prove that a finite group $G$ having at most three conjugacy classes of non-normal non-abelian proper subgroups is always solvable except for $Gcong{rm{A_5}}$, which extends Theorem 3.3 in [Some sufficient conditions on the number of non-abelian subgroups of a finite group to be solvable, Acta Math. Sinica (English Series) 27 (2011) 891--896.]. Moreover, we s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics, Algorithms and Applications
سال: 2011
ISSN: 1793-8309,1793-8317
DOI: 10.1142/s1793830911001401